COARSE-EMOA: An indicator-based evolutionary algorithm for solving equality constrained multi-objective optimization problems

نویسندگان

چکیده

Many real-world applications involve dealing with several conflicting objectives which need to be optimized simultaneously. Moreover, these problems may require the consideration of limitations that restrict their decision variable space. Evolutionary Algorithms (EAs) are capable tackling Multi-objective Optimization Problems (MOPs). However, approaches struggle accurately approximate a feasible solution when considering equality constraints as part problem due inability EAs find and keep solutions exactly at constraint boundaries. Here, we present an indicator-based evolutionary multi-objective optimization algorithm (EMOA) for Equality Constrained MOPs (ECMOPs). In our proposal, adopt artificially constructed reference set closely resembling Pareto front ECMOP calculate Inverted Generational Distance population, is then used density estimator. An empirical study over benchmark each contains least one was performed test capabilities proposed COnstrAined Reference SEt - EMOA (COARSE-EMOA). Our results compared those obtained by six other EMOAs. As will shown, COARSE-EMOA can properly guiding search through use approximates given problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems

Inverted Generational Distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiand manyobjective evolutionary algorithms. In this paper, an IGD indicatorbased evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each gen...

متن کامل

Constrained Test Problems for Multi-objective Evolutionary Optimization

Over the past few years, researchers have developed a number of multi-objective evolutionary algorithms (MOEAs). Although most studies concentrated on solving unconstrained optimization problems, there exists a few studies where MOEAs have been extended to solve constrained optimization problems. As the constraint handling MOEAs gets popular, there is a need for developing test problems which c...

متن کامل

Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization

When solving constrained multi-objective optimization problems, an important issue is how to balance convergence, diversity and feasibility simultaneously. To address this issue, this paper proposes a parameter-free constraint handling technique, a two-archive evolutionary algorithm, for constrained multi-objective optimization. It maintains two co-evolving archives simultaneously: one, denoted...

متن کامل

Multi-objective and MGG evolutionary algorithm for constrained optimization

This paper presents a new approach to handle constrained optimization using evolutionary algorithms. The new technique converts constrained optimization to a two-objective optimization: one is the original objective function, the other is the degree function violating the constraints. By using Paretodominance in the multi-objective optimization, individual's Pareto strength is defined. Based on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Swarm and evolutionary computation

سال: 2021

ISSN: ['2210-6502', '2210-6510']

DOI: https://doi.org/10.1016/j.swevo.2021.100983